The CORALI Project: From Conceptual Graphs to Conceptual Graphs via Labelled Graphs

نویسنده

  • Michel Chein
چکیده

The scientific objectives of the "COnceptual gRAphs at LIrmm" project and the method used to reach these objectives are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generalization/specialization for conceptual graphs

This paper centers on generalization/specialization relation in the framework of conceptual graphs (this relation corresponds to the logical subsumption when considering the logical formulas associated with conceptual graphs). Results given here apply more generally to any model where knowledge is described by labelled graphs and reasoning is based on graph subsumption, like in semantic network...

متن کامل

The Birth of PEIRCE: A Conceptual Graphs Workbench

PEIRCE is a project aiming to build a state-of-the-art, industrial strength conceptual graphs workbench. PEIRCE is integrating the conceptual graphs development eeorts that are taking place around the world. There are already over 40 researchers from over 8 countries involved in the project. This paper describes the PEIRCE project and the structure for managing the distributed development of PE...

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

3-difference cordial labeling of some cycle related graphs

Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...

متن کامل

Managing Large Databases of Complex Medical Knowledge Using Conceptual Graphs

A number of groups around the world are independently working on natural language interfaces (some multilingual) to sources of information such as progress notes, patient discharge summaries, radiology reports, digestive surgery discharge summaries, bone scintigraphy, slit lamp examination of the eye, and echocardiography. Each of these groups is using Conceptual Graphs as their universal medic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997